Sharp one-weight and two-weight bounds for maximal operators
نویسندگان
چکیده
منابع مشابه
Two weight norm inequalities for fractional one-sided maximal and integral operators
In this paper, we give a generalization of Fefferman-Stein inequality for the fractional one-sided maximal operator: Z +∞ −∞ M α (f)(x) w(x) dx ≤ Ap Z +∞ −∞ |f(x)|M αp(w)(x) dx, where 0 < α < 1 and 1 < p < 1/α. We also obtain a substitute of dual theorem and weighted norm inequalities for the one-sided fractional integral I α .
متن کاملSharp Weighted Bounds for Fractional Integral Operators
The relationship between the operator norms of fractional integral operators acting on weighted Lebesgue spaces and the constant of the weights is investigated. Sharp bounds are obtained for both the fractional integral operators and the associated fractional maximal functions. As an application improved Sobolev inequalities are obtained. Some of the techniques used include a sharp off-diagonal...
متن کاملTwo-Weight Orlicz Type Integral Inequalities for the Maximal Operator
p A v = u , (1) holds for t = ) t ( = ) t ( , but not if 1 = p . Also for each < p 1 there exists a pair p A ) v , u ( so that (1) fails in the special case t = ) t ( = ) t ( [3, p. 395]. In these exceptional cases we have a weak type inequality. An excellent reference is the book by J.Garcia-Cuerva and J.L.Rubio de Francia [3]. We refer the reader interested in the current stat...
متن کاملBounds for Weight Balanced Trees
It has been shown that the cost W of a weight balanced binary tree satisfies the inequalities, H 5 W 5 H + 3, where H is the entropy of the set of the leaves. For a class of “smooth” distributions the inequalities, H 5 W 5 H + 2, are derived. These results imply that for sets with large entropy the search times provided by such trees cannot be substantially shortened when binary decisions are b...
متن کاملUpper Bounds for Constant - Weight
| Let A(n; d; w) denote the maximum possible number of codewords in an (n; d; w) constant-weight binary code. We improve upon the best known upper bounds on A(n; d; w) in numerous instances for n 6 24 and d 6 10, which is the parameter range of existing tables. Most improvements occur for d = 8; 10, where we reduce the upper bounds in more than half of the unresolved cases. We also extend the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2009
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm194-2-4